Improved lower bound for the vertex connectivity of (δ; g)-cagesYUQING LIN; MILLER, Mirka; BALBUENA, Camino et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 162-171, issn 0012-365X, 10 p.Article

On the connectivity of (k, g)-cages of even girthYUQING LIN; BALBUENA, Camino; MARCOTE, Xavier et al.Discrete mathematics. 2008, Vol 308, Num 15, pp 3249-3256, issn 0012-365X, 8 p.Article

Conditional conectivity measures for large multiprocessor systemsLATIFI, S; HEGDE, M; NARAGHI-POUR, M et al.IEEE transactions on computers. 1994, Vol 43, Num 2, pp 218-222, issn 0018-9340Article

A kind of conditional vertex connectivity of star graphsMIN WAN; ZHAO ZHANG.Applied mathematics letters. 2009, Vol 22, Num 2, pp 264-267, issn 0893-9659, 4 p.Article

Minimum cost source location problem with local 3-vertex-connectivity requirementsISHII, Toshimasa; FUJITA, Hitoshi; NAGAMOCHI, Hiroshi et al.Theoretical computer science. 2007, Vol 372, Num 1, pp 81-93, issn 0304-3975, 13 p.Article

Maintaining the 3-edge-connected components of a graph on-lineZVI GALIL; ITALIANO, G. F.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 11-28, issn 0097-5397Article

Edge, vertex and mixed fault diametersBANIC, Iztok; ERVES, Rija; ZEROVNIK, Janez et al.Advances in applied mathematics (Print). 2009, Vol 43, Num 3, pp 231-238, issn 0196-8858, 8 p.Article

Computing vertex connectivity : New bounds from old techniquesHENZINGER, M. R; RAO, S; GABOW, H. N et al.Journal of algorithms (Print). 2000, Vol 34, Num 2, pp 222-250, issn 0196-6774Article

Connectivity of the Mycielskian of a digraphLITAO GUO; XIAOFENG GUO.Applied mathematics letters. 2009, Vol 22, Num 10, pp 1622-1625, issn 0893-9659, 4 p.Article

The least eigenvalue of graphs with given connectivityYE, Miao-Lin; FAN, Yi-Zheng; DONG LIANG et al.Linear algebra and its applications. 2009, Vol 430, Num 4, pp 1375-1379, issn 0024-3795, 5 p.Article

Laplacian integral graphs in S(a, b)SILVA DE LIMA, Leonardo; MAIA DE ABREU, Nair Maria; SILVA OLIVEIRA, Carla et al.Linear algebra and its applications. 2007, Vol 423, Num 1, pp 136-145, issn 0024-3795, 10 p.Conference Paper

Connectivity of the Mycielskian of a graphBALAKRISHNAN, R; FRANCIS RAJ, S.Discrete mathematics. 2008, Vol 308, Num 12, pp 2607-2610, issn 0012-365X, 4 p.Article

On an extremal problem related to a theorem of WhitneySINGH, Mohit; TRIPATHI, Amitabha.Discrete applied mathematics. 2007, Vol 155, Num 4, pp 579-583, issn 0166-218X, 5 p.Article

Labeling schemes for flow and connectivityKATZ, Michal; KATZ, Nir A; KORMAN, Amos et al.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 23-40, issn 0097-5397, 18 p.Article

Using expander graphs to find vertex connectivityGABOW, Harold N.Journal of the Association for Computing Machinery. 2006, Vol 53, Num 5, pp 800-844, issn 0004-5411, 45 p.Article

Hardness of approximation for vertex-connectivity network design problemsKORTSARZ, Guy; KRAUTHGAMER, Robert; LEE, James R et al.SIAM journal on computing (Print). 2004, Vol 33, Num 3, pp 704-720, issn 0097-5397, 17 p.Article

Maintenance of 2- and 3-edge-connected components of graphs IILA POUTRE, Han.SIAM journal on computing (Print). 2000, Vol 29, Num 5, pp 1521-1549, issn 0097-5397Article

Maximum Zagreb index, minimum hyper-Wiener index and graph connectivityBEHTOEI, A; JANNESARI, M; TAERI, B et al.Applied mathematics letters. 2009, Vol 22, Num 10, pp 1571-1576, issn 0893-9659, 6 p.Article

The connectivity of a graph and its complementHELLWIG, Angelika; VOLKMANN, Lutz.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3325-3328, issn 0166-218X, 4 p.Conference Paper

Augmenting a (k - 1)-vertex-connected multigraph to an ł-edge-connected and k-vertex-connected multigraphISHII, Toshimasa; NAGAMOCHI, Hiroshi; IBARAKI, Toshihide et al.Algorithmica. 2006, Vol 44, Num 3, pp 257-280, issn 0178-4617, 24 p.Article

Conjectures on index and algebraic connectivity of graphsDAS, Kinkar Ch.Linear algebra and its applications. 2010, Vol 433, Num 8-10, pp 1666-1673, issn 0024-3795, 8 p.Article

Property Testing on k-Vertex-Connectivity of GraphsYOSHIDA, Yuichi; ITO, Hiro.Algorithmica. 2012, Vol 62, Num 3-4, pp 701-712, issn 0178-4617, 12 p.Article

Paths partition with prescribed beginnings in digraphs : A Chvátal-Erdós condition approachBESSY, S.Discrete mathematics. 2008, Vol 308, Num 18, pp 4108-4115, issn 0012-365X, 8 p.Article

On the minimum augmentation of an <script small 1>-connected graph to a k-connected graphISHII, T; NAGAMOCHI, H.Lecture notes in computer science. 2000, pp 286-299, issn 0302-9743, isbn 3-540-67690-2Conference Paper

Bi-connectivity augmentation for specified vertices of a graph with upper bounds on vertex-degree increase : Spection section on foundations of computer scienceMASHIMA, Toshiya; FUKUOKA, Takanori; TAOKA, Satoshi et al.IEICE transactions on information and systems. 2006, Vol 89, Num 2, pp 751-762, issn 0916-8532, 12 p.Article